Domination alteration sets in graphs
نویسندگان
چکیده
منابع مشابه
The Strong Domination Alteration Sets in Fuzzy Graphs
In this paper, the effect of the removal of a node or an arc of a fuzzy graph on the minimum strong dominating set of the fuzzy graph is studied. The motivation behind this study is the identification of fault tolerance in the topological design of a network. That is, the ability of the network to provide service even when it contains a faulty component or components. MSC: 05C69.
متن کاملDomination Alteration Set!3 in Graphs
The domination number a(G) of a graph G is the size of a minimum dominating set, i.e., a set of points with the property that every other point is adjacent to a point of the set. In general a(G) can be made to increase or decrease by the removal of points from G. Our main objective is the study of this phenomenon. For example we show that if T is a tree with at least three points then a(T u) > ...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملOn Point-Set Domination in Graphs II: Minimum PSD-Sets
In this paper, we amend the original proof of a result due to E. Sampathkumar and L. Pushpa Latha [6] as also its variation given in [4] and establish new fundamental results on minimum point-set dominating(psd-)sets in separable graphs.
متن کاملTotal $k$-Rainbow domination numbers in graphs
Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1983
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90085-7